94 research outputs found
High frame-rate cardiac ultrasound imaging with deep learning
Cardiac ultrasound imaging requires a high frame rate in order to capture
rapid motion. This can be achieved by multi-line acquisition (MLA), where
several narrow-focused received lines are obtained from each wide-focused
transmitted line. This shortens the acquisition time at the expense of
introducing block artifacts. In this paper, we propose a data-driven
learning-based approach to improve the MLA image quality. We train an
end-to-end convolutional neural network on pairs of real ultrasound cardiac
data, acquired through MLA and the corresponding single-line acquisition (SLA).
The network achieves a significant improvement in image quality for both
and line MLA resulting in a decorrelation measure similar to that of SLA
while having the frame rate of MLA.Comment: To appear in the Proceedings of MICCAI, 201
Cell nuclei detection using globally optimal active contours with shape prior
Cell nuclei detection in fluorescent microscopic images is an important and time consuming task for a wide range of biological applications. Blur, clutter, bleed through and partial occlusion of nuclei make this a challenging task for automated detection of individual nuclei using image analysis. This paper proposes a novel and robust detection method based on the active contour framework. The method exploits prior knowledge of the nucleus shape in order to better detect individual nuclei. The method is formulated as the optimization of a convex energy function. The proposed method shows accurate detection results even for clusters of nuclei where state of the art methods fail
Precision Tests of the Standard Model
30 páginas, 11 figuras, 11 tablas.-- Comunicación presentada al 25º Winter Meeting on Fundamental Physics celebrado del 3 al 8 de MArzo de 1997 en Formigal (España).Precision measurements of electroweak observables provide stringent tests of the Standard Model structure and an accurate determination of its parameters. An overview of the present experimental status is presented.This work has been supported in part
by CICYT (Spain) under grant No. AEN-96-1718.Peer reviewe
Sparsity-based single-shot sub-wavelength coherent diffractive imaging
We present the experimental reconstruction of sub-wavelength features from
the far-field intensity of sparse optical objects: sparsity-based
sub-wavelength imaging combined with phase-retrieval. As examples, we
demonstrate the recovery of random and ordered arrangements of 100 nm features
with the resolution of 30 nm, with an illuminating wavelength of 532 nm. Our
algorithmic technique relies on minimizing the number of degrees of freedom; it
works in real-time, requires no scanning, and can be implemented in all
existing microscopes - optical and non-optical
A novel underdetermined source recovery algorithm based on k-sparse component analysis
Sparse component analysis (SCA) is a popular method for addressing underdetermined blind source separation in array signal processing applications. We are motivated by problems that arise in the applications where the sources are densely sparse (i.e. the number of active sources is high and very close to the number of sensors). The separation performance of current underdetermined source recovery (USR) solutions, including the relaxation and greedy families, reduces with decreasing the mixing system dimension and increasing the sparsity level (k). In this paper, we present a k-SCA-based algorithm that is suitable for USR in low-dimensional mixing systems. Assuming the sources is at most (m−1) sparse where m is the number of mixtures; the proposed method is capable of recovering the sources from the mixtures given the mixing matrix using a subspace detection framework. Simulation results show that the proposed algorithm achieves better separation performance in k-SCA conditions compared to state-of-the-art USR algorithms such as basis pursuit, minimizing norm-L1, smoothed L0, focal underdetermined system solver and orthogonal matching pursuit
A wide-angle view at iterated shrinkage algorithms
Sparse and redundant representations – an emerging and powerful model for signals – suggests that a data source could be described as a linear combination of few atoms from a pre-specified and over-complete dictionary. This model has drawn a considerable attention in the past decade, due to its appealing theoretical foundations, and promising practical results it leads to. Many of the applications that use this model are formulated as a mixture of ℓ2-ℓp (p ≤ 1) optimization expressions. Iterated Shrinkage algorithms are a new family of highly effective numerical techniques for handling these optimization tasks, surpassing traditional optimization techniques. In this paper we aim to give a broad view of this group of methods, motivate their need, present their derivation, show their comparative performance, and most important of all, discuss their potential in various applications
- …